Constructing dense grid-free linear $3$-graphs
نویسندگان
چکیده
We show that there exist linear $3$-uniform hypergraphs with $n$ vertices and $\Omega(n^2)$ edges which contain no copy of the $3 \times 3$ grid. This makes significant progress on a conjecture Furedi Ruszinko. also discuss connections to proving lower bounds for $(9,6)$ Brown-Erdős-Sos problem Solymosi Solymosi.
منابع مشابه
Constructing dense graphs with sublinear Hadwiger number
Mader asked to explicitly construct dense graphs for which the size of the largest clique minor is sublinear in the number of vertices. Such graphs exist as a random graph almost surely has this property. This question and variants were popularized by Thomason over several articles. We answer these questions by showing how to explicitly construct such graphs using blow-ups of small graphs with ...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملSparse halves in dense triangle-free graphs
In this paper we study the conjecture that any triangle-free graph G on n vertices should contain a set of bn/2c vertices that spans at most n2/50 edges. This problem was considered by Erdős, Faudree, Rousseau and Schelp in [5]. Krivelevich proved the conjecture for graphs with minimum degree at least 2 5n [8]. In [7] Keevash and Sudakov improved this result to graphs with average degree at lea...
متن کاملSqueeze-free Hamiltonian Paths in Grid Graphs
Motivated by multi-robot construction systems, we introduce the problem of finding squeeze-free Hamiltonian paths in grid graphs. A Hamiltonian path is squeeze-free if it does not pass between two previously visited vertices lying on opposite sides. We determine necessary and sufficient conditions for the existence of squeeze-free Hamiltonian paths in staircase grid graphs. Our proofs are const...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2021
ISSN: ['2330-1511']
DOI: https://doi.org/10.1090/proc/15673